VNS-based heuristic with an exponential neighborhood for the server load balancing problem

نویسندگان

  • Ivan Davydov
  • Yury Kochetov
چکیده

We consider the server load balancing problem which is originated from optimal web hosting in cloud computing. We have developed VNS-based heuristic to tackle this problem. In order to improve the efficiency of the algorithm, we apply new exponential neighborhood based on the assignment problem. Computational experiments on real world and randomly generated test instances indicate the efficiency of the algorithm.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Solving a Video-Server Load Re-Balancing Problem by Mixed Integer Programming and Hybrid Variable Neighborhood Search

A Video-on-Demand system usually consists of a large number of independent video servers. In order to utilize network resources as efficiently as possible the overall network load should be balanced among the available servers. We consider a problem formulation based on an estimation of the expected number of requests per movie during the period of highest user interest. Apart from load balanci...

متن کامل

A Hybrid Meta-heuristic for the Dynamic Layout Problem with Transportation System Design

This paper primarily presents a comprehensive dynamic layout design model which integrates layout and transportation system design via considering more realistic assumptions, such as taking account of fixed-position departments and distance between departments that endanger each other. In addition, specific criteria such as capacity, cost and reliability of facilities are considered in transpor...

متن کامل

A heuristic-based hybrid genetic-variable neighborhood search algorithm for task scheduling in heterogeneous multiprocessor system

0020-0255/$ see front matter 2010 Elsevier Inc doi:10.1016/j.ins.2010.10.001 ⇑ Corresponding author. E-mail address: [email protected] (H. Effective task scheduling, which is essential for achieving high performance in a heterogeneous multiprocessor system, remains a challenging problem despite extensive studies. In this article, a heuristic-based hybrid genetic-variable neighborhood s...

متن کامل

Modeling the Time Windows Vehicle Routing Problem in Cross-Docking Strategy Using Two Meta-Heuristic Algorithms

   In cross docking strategy, arrived products are immediately classified, sorted and organized with respect to their destination. Among all the problems related to this strategy, the vehicle routing problem (VRP) is very important and of special attention in modern technology. This paper addresses the particular type of VRP, called VRPCDTW, considering a time limitation for each customer/retai...

متن کامل

Balancing Bicycle Sharing Systems: A Variable Neighborhood Search Approach

We consider the necessary redistribution of bicycles in public bicycle sharing systems in order to avoid rental stations to run empty or entirely full. For this purpose we propose a general Variable Neighborhood Search (VNS) with an embedded Variable Neighborhood Descent (VND) that exploits a series of neighborhood structures. While this metaheuristic generates candidate routes for vehicles to ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Electronic Notes in Discrete Mathematics

دوره 47  شماره 

صفحات  -

تاریخ انتشار 2015